Instructor : Rafael Pass Scribe : Jean - Baptiste Jeannin 1 Administration 1 . 1 Course staff
نویسنده
چکیده
There will be 3 to 4 homeworks in the semester. The first homework is already up or will be by the end of the day.
منابع مشابه
Lecture 19 : Digital Signatures Instructor : Rafael Pass Scribe : Tom Roeder 1 Digital Signature Schemes
We begin by defining a digital signature scheme.
متن کاملLecture 17 : Zero Knowledge for NP Instructor : Rafael Pass Scribe : Eleanor Birrell 1 Definitions of Zero Knowledge
Perfect zero knowledge is exactly the same except that it requires the two distributions to be identical rather than simply indistinguishable. An alternative definition is to replace V IEWV ∗ with OUTPUTV ∗ . The two definitions are equivalent, since the output is included in the view and since V ∗ could simply output its view. There is also a stronger notion of zero knowledge known as black-bo...
متن کاملLecture 19 : Zero Knowledge Proofs - Part 4 Instructor : Rafael Pass Scribe : Shentong Wang Review : Definition for Zero Knowledge
Review: Definition for Zero Knowledge As a review of the previous lecture, it was defined that (P ,V) is a Zero Knowledge proof for L with respect to RL if the following holds: 1. Soundness: ∀x ∈ L,∃y ∈ {0, 1}∗s.t.Pr[Outv[P (x, y) ↔ V (x)] = 1] = 1 2. Completeness: ∀P ∗,∀x 6∈ L, ∀y ∈ {0, 1}∗s.t.Pr[Outv[P ∗(x, y) ↔ V (x)] = 1] ≤ 2(n) 3. For all PPT V ∗, there exists an expected PPT S such that f...
متن کاملPrivate Key Encryption Instructor : Rafael Pass Scribe : Ashwin Machanavajjhala
Till this point in the course we have learnt how to define secrecy and how to construct tools like one way functions, pseudorandom generators and pseudorandom functions. We will now use the concepts we learnt to construct a secure encryption scheme. In this class we propose a few intuitive definitions for the security of an encryption scheme, show their equivalence and then show a simple constr...
متن کاملS 6810 Theory of Computing February 3 , 2009 Lecture 5 : Polynomial Hierarchy Instructor : Rafael Pass Scribe : Navin Sivakumar
Recall that NP can be thought of as the class of languages consisting of strings for which there exists an easily verifiable proof. Similarly, the complementary class coNP can be interpreted as the class of languages consisting of strings for which all proofs fail. Intuitively, problems in NP ask whether there exists a string satisfying certain properties, whereas problems in coNP whether all s...
متن کامل